A termination theorem for sorted multi-adjoint logic programming
نویسنده
چکیده
The structure of the paper is as follows. In Section 2, we introduce the preliminary concepts necessary for the definition of the syntax and semantics of sorted multi-adjoint logic programs, presented in Section 3. In Section 4, we state the basic results regarding the termination properties of our semantics, which are extended later in Section 5. The paper finishes with some conclusions and pointers to future work.
منابع مشابه
Termination Results for Sorted Multi-Adjoint Logic Programs
In this paper we present a logic programming-based language allowing for the combination of several adjoint lattices of truth-values. A model and fixpoint theory are presented, but the main contribution of the paper is the study of general properties guaranteeing termination of all queries. New results are presented and related to other alternative formalisms.
متن کاملTermination of logic programs with imperfect information: applications and query procedure
A general logic programming framework allowing for the combination of several adjoint lattices of truth-values is presented. The language is sorted, enabling the combination of several reasoning forms in the same knowledge base. The contribution of the paper is two-fold: on the one hand, sufficient conditions guaranteeing termination of all queries for the fix-point semantics for a wide class o...
متن کاملSorted Multi-adjoint Logic Programs: Termination Results and Applications
A general framework of logic programming allowing for the combination of several adjoint lattices of truth-values is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several extensions of these conditions are presented and related to some well-known formalisms for probabili...
متن کاملMulti-Adjoint Logic Programming
A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approa...
متن کاملA new approach to completeness for multi-adjoint logic programming
The hypotheses required for the quasicompleteness theorems [5, 7] are restated in terms of termination properties of a calculation algorithm.
متن کامل